The Hardness of Revising Defeasible Preferences
نویسندگان
چکیده
Non-monotonic reasoning typically deals with three kinds of knowledge. Facts are meant to describe immutable statements of the environment. Rules define relationships among elements. Lastly, an ordering among the rules, in the form of a superiority relation, establishes the relative strength of rules. To revise a non-monotonic theory, we can change either one of these three elements. We prove that the problem of revising a non-monotonic theory by only changing the superiority relation is a NP-complete problem.
منابع مشابه
Revising Nonmonotonic Theories: The Case of Defeasible Logic
The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are the fact that intelligent systems are gradually developed and refined, and that often the environment of an intelligent system is not static but changes over time. Traditionally belief revision has been concerned with revising f...
متن کاملRevising Nonmonotonic Belief Sets: The Case of Defeasible Logic
The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are the fact that intelligent systems are gradually developed and refined, and that often the environment of an intelligent system is not static but changes over time. Traditionally belief revision has been concerned with revising f...
متن کاملAn Argumentation Framework for Deriving Qualitative Risk Sensitive Preferences
Preferences are derived in part from knowledge. Knowledge, however, may be defeasible. We present an argumentation framework for deriving qualitative, multi-attribute preferences and incorporate defeasible reasoning about knowledge. Intuitively, preferences based on defeasible conclusions are not as strong as preferences based on certain conclusions, since defeasible conclusions may turn out no...
متن کاملProgramming Cognitive Agents in Defeasible Logic
Defeasible Logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences and actions, together with inference procedures. We discuss patterns of agent types in this setting. Finally, we illustrate the language by an example of an agent reasoning about web-services.
متن کاملPreferences of Agents in Defeasible Logic
We are interested in programming languages for cognitive agents with preferences. We define rule-based agent theories and inference procedures in defeasible logic, and in this setting we discuss patterns of agent behavior called agent types.
متن کامل